Stochastic collocation approach with adaptive mesh refinement for parametric uncertainty analysis
نویسندگان
چکیده
منابع مشابه
A Stochastic Collocation Algorithm for Uncertainty Analysis
This report describes a stochastic collocation method to adequately handle a physically intrinsic uncertainty in the variables of a numerical simulation. For instance, while the standard Galerkin approach to Polynomial Chaos requires multi-dimensional summations over the stochastic basis functions, the stochastic collocation method enables to collapse those summations to a one-dimensional summa...
متن کاملAdaptive Mesh Refinement for Multiscale
plied and theoretical physics is to fully understand and predict the behavior of systems far from thermodynamic equilibrium,1–4 including those systems driven by an external force or experiencing a sudden change in environment (such as pressure or temperature). They also include systems transitioning from one metastable or long-lived state to another. The need to accurately model and numericall...
متن کاملEfficient Collocational Approach for Parametric Uncertainty Analysis
A numerical algorithm for effective incorporation of parametric uncertainty into mathematical models is presented. The uncertain parameters are modeled as random variables, and the governing equations are treated as stochastic. The solutions, or quantities of interests, are expressed as convergent series of orthogonal polynomial expansions in terms of the input random parameters. A high-order s...
متن کاملA Trust-Region Algorithm with Adaptive Stochastic Collocation for PDE Optimization under Uncertainty
The numerical solution of optimization problems governed by partial differential equations (PDEs) with random coefficients is computationally challenging because of the large number of deterministic PDE solves required at each optimization iteration. This paper introduces an efficient algorithm for solving such problems based on a combination of adaptive sparse-grid collocation for the discreti...
متن کاملRelativistic MHD with Adaptive Mesh Refinement
This paper presents a new computer code to solve the general relativistic magnetohydrodynamics (GRMHD) equations using distributed parallel adaptive mesh refinement (AMR). The fluid equations are solved using a finite difference Convex ENO method (CENO) in 3 + 1 dimensions, and the AMR is Berger-Oliger. Hyperbolic divergence cleaning is used to control the ∇ · B = 0 constraint. We present resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2018
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2018.06.003